---
title: "L1-079 天梯赛的善良"
created: 2025-11-28
tags:
  - 算法
---

# L1-079 天梯赛的善良

## 题目 [L1-079 天梯赛的善良](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1386335159927652358&page=0)

![[image-32f4a96d.png]]

## 思路分析

## 代码实现

```cpp
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]= {-1,0,1,0},dy[4]= {0,1,0,-1};

const int inf = 0x3f3f3f3f;

int main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	map<int,int> student;

	int n;cin>>n;

	int maxv=-inf,minv=inf;

	for(int i=0;i<n;i++){

		int tmp;cin>>tmp;

		maxv=max(maxv,tmp);

		minv=min(minv,tmp);

		student[tmp]++;

	}

	cout<<minv<<" "<<student[minv]<<endl;

	cout<<maxv<<" "<<student[maxv]<<endl;

	return 0;

}
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-078 吉老师的回归|L1-078 吉老师的回归]] 🏠 [[00-天梯赛]] ➡️ [[L1-080 乘法口诀数列|L1-080 乘法口诀数列]]